The E t-Construction for Lattices, Spheres and Polytopes
نویسندگان
چکیده
We describe and analyze a new construction that produces new Eulerian lattices from old ones. It specializes to a construction that produces new strongly regular cellular spheres (whose face lattices are Eulerian). The construction does not always specialize to convex polytopes; however, in a number of cases where we can realize it, it produces interesting classes of polytopes. Thus we produce an infinite family of rational 2-simplicial 2-simple 4-polytopes, as requested by Eppstein, Kuperberg and Ziegler [6]. We also construct for each d ≥ 3 an infinite family of (d− 2)-simplicial 2-simple d-polytopes, thus solving a problem of Grünbaum [9].
منابع مشابه
Et-Construction for Lattices, Spheres and Polytopes
We describe and analyze a new construction that produces new Eulerian lattices from old ones. It specializes to a construction that produces new strongly regular cellular spheres (whose face lattices are Eulerian). The construction does not always specialize to convex polytopes; however, in a number of cases where we can realize it, it produces interesting classes of polytopes. Thus we produce ...
متن کاملFace Numbers of 4-Polytopes and 3-Spheres
Steinitz (1906) gave a remarkably simple and explicit description of the set of all f -vectors f(P ) = (f0, f1, f2) of all 3-dimensional convex polytopes. His result also identifies the simple and the simplicial 3-dimensional polytopes as the only extreme cases. Moreover, it can be extended to strongly regular CW 2-spheres (topological objects), and further to Eulerian lattices of length 4 (com...
متن کاملAlternative approaches to obtain t-norms and t-conorms on bounded lattices
Triangular norms in the study of probabilistic metric spaces as a special kind of associative functions defined on the unit interval. These functions have found applications in many areas since then. In this study, we present new methods for constructing triangular norms and triangular conorms on an arbitrary bounded lattice under some constraints. Also, we give some illustrative examples for t...
متن کاملConvex hulls of spheres and convex hulls of disjoint convex polytopes
Given a set Σ of spheres in E, with d ≥ 3 and d odd, having a constant number of m distinct radii ρ1, ρ2, . . . , ρm, we show that the worst-case combinatorial complexity of the convex hull of Σ is Θ( ∑ 1≤i6=j≤m nin ⌊ d 2 ⌋ j ), where ni is the number of spheres in Σ with radius ρi. To prove the lower bound, we construct a set of Θ(n1+n2) spheres in E , with d ≥ 3 odd, where ni spheres have rad...
متن کاملEnumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that their barycentric subdivisions are simplicial polytopes. The complete information on the numbers of faces and chains of faces in these spheres can be obtained from the defining lattices in a manner analogous to the rel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 32 شماره
صفحات -
تاریخ انتشار 2004